Exchanging without Exploiting
نویسندگان
چکیده
منابع مشابه
Exchanging Secrets without Using Cryptography
We consider the problem where a group of n nodes, connected to the same broadcast channel (e.g., a wireless network), want to generate a common secret bitstream, in the presence of an adversary Eve, who tries to obtain information on the bitstream. We assume that the nodes initially share a (small) piece of information, but do not have access to any out-of-band channel. We ask the question: can...
متن کاملExploiting Regularity Without Development
A major challenge in evolutionary computation is to find the right level of abstraction of biological development to capture its essential properties without introducing unnecessary inefficiencies. In this paper, a novel abstraction of natural development, called Compositional Pattern Producing Networks (CPPNs), is proposed. Unlike most computational abstractions of natural development, CPPNs d...
متن کاملExploiting Branch Constraints without Exhaustive Path Enumeration
Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program’s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop witho...
متن کاملExchanging Emotions - SOM Approach
Today’s cellular phones are still based on the age-old views of what a telephone can do, that is transmit speech. However, in human interaction, communication is not based just on the actual words but also on the way how the words are spoken. How to better take this into account in the design of future phones? How to make the phones less technical, more personal? In this paper, we try to answer...
متن کاملSorting by Exchanging
We adopt the following convention: α, β, γ, δ denote ordinal numbers, k denotes a natural number, and x, y, z, t, X, Y , Z denote sets. The following propositions are true: (1) x ∈ (α+ β) \ α iff there exists γ such that x = α+ γ and γ ∈ β. (2) Suppose α ∈ β and γ ∈ δ. Then γ 6= α and γ 6= β and δ 6= α and δ 6= β or γ ∈ α and δ = α or γ ∈ α and δ = β or γ = α and δ ∈ β or γ = α and δ = β or γ =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Historical Materialism
سال: 2015
ISSN: 1465-4466,1569-206X
DOI: 10.1163/1569206x-12341425